Paths to stable allocations

Paths to Stable Allocations

The stable allocation problem is one of the broadest extensions of the well-known stable marriage problem. In an allocation problem, edges of a bipartite graph have capacities and vertices have quotas to fill. Here we investigate the case of uncoordinated processes in stable allocation instances. In this setting, a feasible allocation is given and the aim is to reach a stable allocation by rais...

Stable allocations of risk

The measurement and the allocation of risk are fundamental problems of portfolio management. Coherent measures of risk provide an axiomatic approach to the former problem. In an environment given by a coherent measure of risk and the various portfolios’ realization vectors, risk allocation games aim at solving the second problem: How to distribute the diversification benefits of the various por...

Insensitive, maximum stable allocations converge to proportional fairness

We describe a queueing model where service is allocated as a function of queue sizes. We consider allocations policies that are insensitive to service requirements and have a maximal stability region. We take a limit where the queueing model becomes congested. We study how service is allocated under this limit. We demonstrate that the only possible limit allocation is one that maximizes a propo...

Bargained stable allocations in assignment markets

For each assignment market, an associated bargaining problem is defined and some bargaining solutions to this problem are analyzed. For a particular choice of the disagreement point, the Nash solution and the Kalai–Smorodinsky solution coincide and give the midpoint between the buyers-optimal core allocation and the sellers-optimal core allocation, and thus they belong to the core. Moreover, un...

Evolutionarily Stable Reproductive Allocations in Heterostylous Plants.